Join-Reachability Problems in Directed Graphs
نویسندگان
چکیده
منابع مشابه
Fault Tolerant Reachability for Directed Graphs
Let G = (V,E) be an n-vertices m-edges directed graph. Let s ∈ V be any designated source vertex, and let T be an arbitrary reachability tree rooted at s. We address the problem of finding a set of edges E ⊆ E\T of minimum size such that on a failure of any vertex w ∈ V , the set of vertices reachable from s in T ∪ E\{w} is the same as the set of vertices reachable from s in G\{w}. We obtain th...
متن کاملReachability Oracles for Directed Transmission Graphs
Let P ⊂ R be a set of n points in the d dimensions such that each point p ∈ P has an associated radius rp > 0. The transmission graph G for P is the directed graph with vertex set P such that there is an edge from p to q if and only if d(p, q) ≤ rp, for any p, q ∈ P . A reachability oracle is a data structure that decides for any two vertices p, q ∈ G whether G has a path from p to q. The quali...
متن کاملImproved Dynamic Reachability Algorithms for Directed Graphs
We obtain several new dynamic algorithms for maintaining the transitive closure of a directed graph and several other algorithms for answering reachability queries without explicitly maintaining a transitive closure matrix. Among our algorithms are: (i) A decremental algorithm for maintaining the transitive closure of a directed graph, through an arbitrary sequence of edge deletions, in O(mn) t...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملExtremal Problems for Directed Graphs
We consider directed graphs without loops and multiple edges, where the exclusion of multiple edges means that two vertices cannot be joined by two edges of the same orientation. Let L I ,. . ., LQ be given digraphs. What is the maximum number of edges a digraph can have if it does not contain any L i as a subgraph and has given number of vertices? We shall prove the existence of a sequence of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2013
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-013-9450-7